Context Tree Compression of Multi-Component Map Images
نویسندگان
چکیده
We consider compression of multi-component map images by context modeling and arithmetic coding. We apply optimized multi-level context tree for modeling the individual binary layers. The context pixels can be located within a search area in the current layer, or in a reference layer that has already been compressed. The binary layers are compressed using an optimized processing sequence that makes maximal utilization of the inter-layer dependencies. The structure of the context tree is static variable depth binary tree, and the context information is stored only in the leaves of the tree. The proposed technique achieves improvement of about 25 % over static 16 pixel context template, and 15 % over similar single-level context tree.
منابع مشابه
Compression of map images by multi-level context tree modeling
We propose a method for compressing color map images by context tree modeling and arithmetic coding. We consider multi-component map images with semantic layer separation, and images that are divided into binary layers by color separation. The key issue in the compression method is the utilization of inter-layer correlations, and to solve the optimal ordering of the layers. The inter-layer depe...
متن کاملMulti-layer context tree modeling for lossless compression of gray-scale images
Multi-layer context tree (MCT) modeling has been recently applied for lossless compression of multi-layer map images and showed its efficiency. Though it is not applicable directly to compression of gray-scale images, it could be utilized together with bit-plane separation technique. In this work we evaluated the performance of MCT modeling according to three bit-plane separation methods and co...
متن کاملOptimized Context Templates for Context-based Compression of Multi-component Map Images
We present a method for estimating optimal context templates that are used for conditioning the pixel probabilities in context-based image compression. The algorithm optimizes the location of the context pixels within a limited neighborhood area, and produces the ordered template as a result. The ordering can be used to determine the shape of the context template for a given template size. The ...
متن کاملLossless Contour Compression Using Chain-code Representations and Context Tree Coding
In this paper we experimentally study the context tree coding of contours in two alternative chain-code representations. The contours of the image regions are intersecting, resulting in many contour segments, each contour segment being represented by its starting position and a subsequence of chain-code symbols. A single stream of symbols is obtained, under a given ordering of the segments, by ...
متن کاملLossless image compression via bit-plane separation and multilayer context tree modeling
Color separation and highly optimized context tree modeling for binary layers have provided the best compression results for color map images that consist of highly complex spatial structures but only a relatively few number of colors. We explore whether this kind of approach works on photographic and palette images as well. The main difficulty is that these images can have a much higher number...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002